Logic Program Synthesis

Logic Frameworks for Logic Programs

We show how logical frameworks can provide a basis for logic program synthesis. With them, we may use first-order logic as a foundation to formalize and derive rules that constitute program development calculi. Derived rules may be in turn applied to synthesize logic programs using higher-order resolution during proof that programs meet their specifications. We illustrate this using Paulson’s I...

Analogical Logic Program Synthesis from Examples

The purpose of this paper is to present a theory and an algorithm for analogical logic program synthesis from examples. Given a source program and examples, the task of our algorithm is to nd a program which explains the examples correctly and is similar to the source program. Although we can de ne a notion of similarity in various ways, we consider a class of similarities from the viewpoint of...

Logic Program Synthesis in a Higher-Order Setting

We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been implemented within the proof planning system λClam . The generality of the approach is such that its extension to allow synthesis of higher-order logic programs was straightforward. Some illustrative examples are given....

Iterative Induction of Logic Programs, An approach to logic program synthesis from incomplete specifications

A Formal Approach to Deductive Synthesis of Constraint Logic Programs

Formal program synthesis is concerned with deriving programs that are (formally) correct wrt their speciications, and is therefore of crucial importance to formal development of veriiably correct software. Declarative paradigms such as logic programming are particularly suitable for program synthesis, and we have formulated a formal approach to synthesising standard logic programs. Our approach...